Merits of interactive decision tree building: Part 1
نویسندگان
چکیده
منابع مشابه
Dialogue Management as Interactive Tree Building
We introduce a new dialogue model and a formalism for limited-domain dialogue systems, which works by interactively building dialogue trees. The model borrows its fundamental ideas from type theoretical grammars and Dynamic Syntax. The resulting dialogue theory is a simple and light-weight formalism, which is still capable of advanced dialogue behaviour.
متن کاملInteractive Exploration of Decision Tree Results
Our investigation aims at interactively exploring the decision tree results obtained by the machine-learning algorithms like C4.5. We propose an interactive graphical environment using the new radial tree layout, zoom/pan techniques and some existing visualization methods like explorer-like, hierarchical visualization, interactive techniques to represent large decision trees in a graphical mode...
متن کاملStaffas Decision-makers: the Merits of Decentralized Decision-making
During the 1950s and 1960s, research teams across the country searched for differences that explained why some organizations were highly successful while others were only marginally successful, if at all. Several of them came to similar explanations involving managerial treatment and use of their subordinates. Major researchers were Rensis Likert, Douglas McGregor, Robert R. Blake (withJane S. ...
متن کاملMultiobjective Decision - Tree Analysis 1
Single-objective-based decision-tree analysis has been extensively and successfully used in numerous decision-making problems since its formal introduction by Howard Raiffa more than two decades ago. This paper extends the traditional methodology to incorporate multiple noncommensurate objective functions and use of the conditional expected value of the risk of extreme and catastrophic events. ...
متن کاملHierarchical Classificator: a Cognitive Approach to Decision Tree Building
We present a new algorithm that follows “divide and conquer” machine learning approach and exhibits a few interesting cognitive properties. The algorithm aims at building the decision tree with only one terminal node per class. Splits of tree nodes are constrained to functions that take identical values (true or false) for every instance within the same class. Appropriate splits are found throu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Targeting, Measurement and Analysis for Marketing
سال: 2007
ISSN: 1479-1862
DOI: 10.1057/palgrave.jt.5750045